BITs and FDI Revisited: A Matching Approach

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust Point Matching Revisited: A Concave Optimization Approach

The well-known robust point matching (RPM) method uses deterministic annealing for optimization, and it has two problems. First, it cannot guarantee the global optimality of the solution and tends to align the centers of two point sets. Second, deformation needs to be regularized to avoid the generation of undesirable results. To address these problems, in this paper we first show that the ener...

متن کامل

Exports versus FDI revisited: Does finance matter?

The crisis on international financial markets that started in 2007 has shown the potential links between the financial sector and the real economy. Exports and foreign direct investment (FDI) have declined, presumably not only because of a lack of demand, but also because of restricted access of firms to external finance. In this paper, we explore the impact of access to external finance on fir...

متن کامل

More Stringent BITs, Less Ambiguous Effects on FDI? Not a Bit!

We focus on investor-state dispute settlement provisions contained in various, though far from all, bilateral investment treaties as a possible determinant of BIT-related effects on bilateral FDI flows. Our estimation results prove to be sensitive to the specification of these provisions as well as the inclusion of transition countries in the sample. Stricter dispute settlement provisions do no...

متن کامل

Source matching problems revisited

The source matching problem is to find the minimax codes that minimize the maximum redundancies over classes of sources where relative entropy (cross entropy, discrimination information) is adopted as a criterion to measure the redundancy. The convergence of a simple approach different from Davisson and Leon-Garcia’s algorithm for finding such minimax codes is presented and shown. This approach...

متن کامل

Multiple Pattern Matching Revisited

We consider the classical exact multiple string matching problem. Our solution is based on q-grams combined with pattern superimposition, bit-parallelism and alphabet size reduction. We discuss the pros and cons of the various alternatives of how to achieve best combination. Our method is closely related to previous work by (Salmela et al., 2006). The experimental results show that our method p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Open Journal of Political Science

سال: 2021

ISSN: 2164-0505,2164-0513

DOI: 10.4236/ojps.2021.112023